import java.util.LinkedList;
import java.util.Queue;
class Node{
    public int x;
    public int y;
    public int n;
    public String s;
}
public class demo01 {
    public static char[] d={'D','L','R','U'};
    public static int[] dx={1,0,0,-1};
    public static int[] dy={0,-1,1,0};
    public static void main(String[] args) {
        int n=30;
        int m=50;
        String[] arr1={
                "01010101001011001001010110010110100100001000101010",
                "00001000100000101010010000100000001001100110100101",
                "01111011010010001000001101001011100011000000010000",
                "01000000001010100011010000101000001010101011001011",
                "00011111000000101000010010100010100000101100000000",
                "11001000110101000010101100011010011010101011110111",
                "00011011010101001001001010000001000101001110000000",
                "10100000101000100110101010111110011000010000111010",
                "00111000001010100001100010000001000101001100001001",
                "11000110100001110010001001010101010101010001101000",
                "00010000100100000101001010101110100010101010000101",
                "11100100101001001000010000010101010100100100010100",
                "00000010000000101011001111010001100000101010100011",
                "10101010011100001000011000010110011110110100001000",
                "10101010100001101010100101000010100000111011101001",
                "10000000101100010000101100101101001011100000000100",
                "10101001000000010100100001000100000100011110101001",
                "00101001010101101001010100011010101101110000110101",
                "11001010000100001100000010100101000001000111000010",
                "00001000110000110101101000000100101001001000011101",
                "10100101000101000000001110110010110101101010100001",
                "00101000010000110101010000100010001001000100010101",
                "10100001000110010001000010101001010101011111010010",
                "00000100101000000110010100101001000001000000000010",
                "11010000001001110111001001000011101001011011101000",
                "00000110100010001000100000001000011101000000110011",
                "10101000101000100010001111100010101001010000001000",
                "10000010100101001010110000000100101010001011101000",
                "00111100001000010000000110111000000001000000001011",
                "10000001100111010111010001000110111010101101111000"};
        int[][] arr=new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                int num= arr1[i].charAt(j)-'0';
                arr[i][j]=num;
            }
        }
        Queue<Node> queue=new LinkedList<>();
        Node tmp=new Node();
        tmp.x=0;
        tmp.y=0;
        tmp.n=2;
        tmp.s="";
        arr[0][0]= tmp.n;
        queue.offer(tmp);
        while (!queue.isEmpty()){
            Node tmp1=queue.poll();
            for (int i = 0; i < 4; i++) {
                int i1=tmp1.x+dx[i];
                int j1=tmp1.y+dy[i];
                String s1=tmp1.s;
                if(i1>=0&&i1<arr.length&&j1>=0&&j1<arr[i].length&&arr[i1][j1]==0){
                    Node tmp2=new Node();
                    arr[i1][j1]=tmp1.n+1;
                    tmp2.x=i1;
                    tmp2.y=j1;
                    tmp2.n=arr[i1][j1];
                    tmp2.s=s1+d[i];
                    queue.offer(tmp2);
                    if(i1==n-1&&j1==m-1){
                        System.out.println(tmp2.s);
                        break;
                    }
                }
            }
        }
    }
}
